Information Mandala: Statistical Distance Matrix with Clustering

نویسندگان

چکیده

In machine learning, observation features are measured in a metric space to obtain their distance function for optimization. Given similar that statistically sufficient as population, statistical between two probability distributions can be calculated more precise learning. Provided the observed multi-valued, is still efficient. However, due its scalar output, it cannot applied represent detailed distances feature elements. To resolve this problem, paper extends traditional matrix form, called matrix. The proposed approach performs well object recognition tasks and clearly intuitively represents dissimilarities cat dog images CIFAR dataset, even when directly using image pixels. By hierarchical clustering of matrix, pixels separated into several clusters geometrically arranged around center like Mandala pattern. with Information Mandala.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Clustering with Limited Distance Information

Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model we assume that we have access to one versus all queries that given a point s ∈ S return the distances between s and all other points. We show that given a natural assumption about the structure of the instance, we can ...

متن کامل

Distance Metric Learning with Application to Clustering with Side-Information

Many algorithms rely critically on being given a good metric over their inputs. For instance, data can often be clustered in many “plausible” ways, and if a clustering algorithm such as K-means initially fails to find one that is meaningful to a user, the only recourse may be for the user to manually tweak the metric until sufficiently good clusters are found. For these and other applications r...

متن کامل

Managing distance and covariate information with point-based clustering

BACKGROUND Geographic perspectives of disease and the human condition often involve point-based observations and questions of clustering or dispersion within a spatial context. These problems involve a finite set of point observations and are constrained by a larger, but finite, set of locations where the observations could occur. Developing a rigorous method for pattern analysis in this contex...

متن کامل

Min-sum Clustering of Protein Sequences with Limited Distance Information

We study the problem of efficiently clustering protein sequences in a limited information setting. We assume that we do not know the distances between the sequences in advance, and must query them during the execution of the algorithm. Our goal is to find an accurate clustering using few queries. We model the problem as a point set S with an unknown metric d on S, and assume that we have access...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2021

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2021.3072237